Encapsulation of Actions and Plans in Conditional Planning Systems

نویسندگان

  • Marco Baioletti
  • Stefano Marcugini
  • Alfredo Milani
چکیده

We introduce a notion of macroaction for a given subplan. A macroaction is an action representing the given plan and it can be considered as an abstraction, neglecting the internal structure of the original plan. The description of the macroaction is sufficiently powerful to represent all the information needed for synchronization and clobbering detection of the given subplan. It is possible to prove that when substituting in a correct plan a macroaction with its real composition, the overall plan remains correct. It is pointed out that it is possible to build large libraries of plans by means of techniques of plan compilation and manage them with fast-selection and plan re-use methods. A comparison of different kind of macroactions is done in the frameworks of linear, non-linear and conditional planning. It is shown that a conditional macroaction is required even in the case of nonlinear unconditional plans. A conditional planning model based on conditional formula calculus is used. Conditional formulae represent uncertain situations and denote sets of mutually exclusive states. The method of compilation is defined through a weakest precondition semantics for conditional plans.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polynomial-Length Planning Spans the Polynomial Hierarchy

This paper presents a family of results on the computational complexity of the decision problem associated with planning: Does a valid plan exist? We consider the effect on complexity of several assumptions typical of classical planning: complete knowledge of the initial state, determinism, polynomial-time determination of executability of actions in a state. We consider plans of two types: con...

متن کامل

Polynomial-Length Planning Spans the Polynomial Hierarchy (Incomplete Draft)

This paper presents a family of results on the computational complexity of the decision problem associated with planning: Does a valid plan exist? Several classes of planning problems are considered: classical planning, conformant planning, conditional planning with full or partial observability. Throughout, attention is restricted to plans of polynomiallybounded length. For conditional plannin...

متن کامل

Planning with Sensing Actions and Incomplete Information Using Logic Programming

We present a logic programming based conditional planner that is capable of generating both conditional plans and conformant plans in the presence of sensing actions and incomplete information. We prove the correctness of our implementation and show that our planner is complete with respect to the 0approximation of sensing actions and the class of conditional plans considered in this paper. Fin...

متن کامل

Computing Contingent Plans via Fully Observable Non-Deterministic Planning

Planning with sensing actions under partial observability is a computationally challenging problem that is fundamental to the realization of AI tasks in areas as diverse as robotics, game playing, and diagnostic problem solving. Recent work on generating plans for partially observable domains has advocated for online planning, claiming that offline plans are often too large to generate. Here we...

متن کامل

مسیر بودجه‌ریزی عملیاتی نوین

By studying the evolution history of budgeting systems, you may discern three stages: In the first stage, controlling role of budget is regarded its major function. In the second stage, budget is considered as a means for management improvement. In the third stage, the role of budget is considered in economic planning, implementation of programs and government performance management. After Wor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996